Sentential notations: unique decomposition.
نویسندگان
چکیده
منابع مشابه
Unique Decomposition of Processes
Mimer, R. and F. Moller, Unique decomposition of processes, Theoretical Computer Science 107 (1993) 357-363. In this paper, we examine questions about the prime decomposability of processes, where we define a process to be prime whenever it cannot be decomposed into nontrivial components. We show that any finite process can be uniquely decomposed into prime processes with respect to bisimulatio...
متن کاملUnique Decomposition in Classifiable Theories
By a classifiable theory we shall mean a theory which is superstable, without the dimensional order property, which has prime models over pairs. In order to define what we mean by unique decomposition, we remind the reader of several definitions and results. We adopt the usual conventions of stability theory and work inside a large saturated model of a fixed classifiable theory T ; for instance...
متن کاملA Unique Orthogonal Variance Decomposition
Let e and Σ be respectively the vector of shocks and its variance covariance matrix in a linear system of equations in reduced form. This article shows that a unique orthogonal variance decomposition can be obtained if we impose a restriction that maximizes the trace of A, a positive definite matrix such that e Az = where z is vector of uncorrelated shocks with unit variance. Such a restriction...
متن کاملA Representation Theorem for Unique Decomposition Categories
Haghverdi introduced the notion of unique decomposition categories as a foundation for categorical study of Girard’s Geometry of Interaction (GoI). The execution formula in GoI provides a semantics of cut-elimination process, and we can capture the execution formula in every unique decomposition category: each hom-set of a unique decomposition category comes equipped with a partially defined co...
متن کاملComputational Content of Unique Decomposition Proofs
languages usually involves proving a decomposition theorem. Not only is such a proof tedious, un-inspiring, and error-prone, but also it is usually attempted many times during the design of a theory. With an eye towards automation, we develop an algorithm for checking the statement of the decomposition theorem. Our algorithm is expressed as a sound and complete term rewriting system with respec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1979
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093882545